模糊多属性群决策与潜艇作战方案优选

分析了潜艇作战方案的优选实质是一个模糊多属性的群决策过程,建立了模糊多属性群决策的一般模型,介绍了一种以模糊理想解与模糊负理想解同时作为参照基准,以海明距离作为测度工具,以相对贴近度作为衡量标准的模糊折衷型多属性群决策方法,应用实例表明此方法可行有效。     

高精度差分格式WNND的构造及数值实验

基于二阶NND格式,通过引入Jiang和Shu的加权思想以及具有TVD性质的三阶Runge Kutta方法,构造了一种时间、空间均达到三阶精度的WNND格式。分别以波动方程、一维Euler方程和三维全Navier Stokes方程为例,通过对WNND格式的数值结果分析表明,WNND格式引起的耗散和波动较小,并且能够高精度地分辨场间断。     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

SPH的两种并行计算方案及其在自由表面流动模拟中的应用

针对光滑粒子动力学(SPH)主要计算量是近邻粒子搜索这一特点,提出了一种基于粒子分解的SPH并行计算方案。利用该方案可以方便的将任意串行SPH代码并行计算,而且每一个时间步内的信息传递量只和粒子总数有关,而和粒子的分布无关,因而特别适合于自由表面流动等大变形问题的并行数值模拟。对一个粒子总数为40万的三维溃坝问题的模拟结果表明,此方案能达到的最大加速比约为16,这一结果可能比空间分解方案(不考虑动态负载均衡)更优。     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

飞机电磁弹射系统发展及其关键技术

总结论述了美国和英法国家的飞机电磁弹系统工程化应用研制的发展状况,综述了电磁弹射用直线电机的方案选型设计、仿真技术、性能优化和控制方法等方面的关键技术和研究现状,针对电磁弹射技术的发展前景和应用给出了相关建议,为国内电磁弹射相关技术的发展提供了借鉴。     

基于灰色关联投影法的空中加油机驻场选址评价

提出了一种基于灰色关联投影法的空中加油机驻场选址评价方法,分析了空中加油机驻场选址影响因素,设计了评价指标体系,并运用熵值理论客观赋权,构建了加权灰色关联决策矩阵。通过比较备选方案与理想方案灰色关联投影角,根据灰色关联投影值对备选方案进行优劣排序。算例分析结果符合现实场站选择条件,说明该方法能够有效解决空中加油机驻场选址问题。     

高超声速横向喷流的三维数值模拟

采用有限体积法,结合半隐的Harten TVD格式和Baldwin Lomax代数湍流模型,求解了三维全N S方程,计算了超声速气流干扰流场,并与实验数据进行了比较,模拟清晰地捕捉到喷流附近复杂波系结构和旋涡结构,并且显示出了弹体表面受到喷流影响的区域,说明横向喷流干扰对弹体影响非常大。     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.